Transmission-Efficient Routing in Wireless Networks Using Link-State Information

The e ciency with which the routing protocol of a multihop packet-radio network uses transmission bandwidth is critical to the ability of the network nodes to conserve energy. We present and verify the source-tree adaptive routing (STAR) protocol, which we show through simulation experiments to be far more e cient than both table-driven and on-demand routing protocols proposed in the recent past for wireless networks. A router in STAR communicates to its neighbors the parameters of its source routing tree, which consists of each link that the router needs to reach every destination. To conserve transmission bandwidth and energy, a router transmits changes to its source routing tree only when the router detects new destinations, the possibility of looping, or the possibility of node failures or network partitions. Simulation results show that STAR is an order of magnitude more e cient than any topology-broadcast protocol and far more e cient than the Dynamic Source Routing (DSR) protocol, which has been shown to be one of the best performing on-demand routing protocols. This work was supported in part at UCSC by the Defense Advanced Research Projects Agency (DAR PA) under Grant F30602-97-2-0338.